Coding for write-unidirectional memories and conflict resolution
نویسندگان
چکیده
Write-unidirectional memories (WUMs) have been introduced recently. They are binary storage devices having a close relationship to write-once memories (WOMs). When updating the information stored by a WUM the encoder can write 1 's to some positions of the WUM or O's to some positions of the WUM but it is not allowed to do both at the same time. Wolf, Wyner, Ziv and Korner investigated WOMs in the four cases arising if the encoder and/or the decoder is informed/uninformed about the previous state of the memory. We investigate the WUMs under these circumstances. We mostly deal with the two cases when the encoder is uninformed, and give bounds and conjectures on the best achievable rates. In the last part, we discuss a related combinatorial problem: conflict resolution on a multiple access channel.
منابع مشابه
Coding for a Model of Random-access Memories of a Computer and Write-unidirectional Memories
The OR-NOT operation x _ y between two binary vectors x and y of the same length is viewed as an operation between the new and old content of a random-access memory used to increase the speed of the access to the memory. Coding procedures that allow us to recover x based on x_y are developed and connections of this model of the memory with the model of write-unidirectional memory are established.
متن کاملWriting on Dirty Memory
Non-volatile memories (NVM) including flash memories and resistive memories have attracted significant interest as data storage media. Flash memories are widely employed in mobile devices and solid-state drives (SSD). Resistive memories are promising as storage class memory and embedded memory applications. Data reliability is the fundamental requirement of NVM as data storage media. However, m...
متن کاملReusable Memories in the Lightof
Arbitrarily varying channels were introduced as a model for transmission in cases of jamming. We show that their theory also naturally applies to memories and yields in a uni ed way some new and all old Capacity Theorems for write{unidirectional (and more general) memories with side information. If the encoder has no side information it is still not understood what the optimal rates for many cy...
متن کاملCoding for Write{eecient Memory
We introduce write{eecient memories (WEM) as a new model for storing and updating information on a rewritable medium. There is a cost ' : X X ! R 1 assigned to changes of letters.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 24 شماره
صفحات -
تاریخ انتشار 1989